Analytical solutions for tree-like structure modelling using subdivision surfaces
نویسندگان
چکیده
We present a novel approach to efficiently modelling branch structures with high-quality meshes. Our approach has the following advantages. First, the limit surface can fit the target skeleton models as tightly as possible by reversely calculating the control vertices of subdivision surfaces. Second, high performance is achieved through our proposed analytical solutions and the parallel subdivision scheme on a graphics processing unit. Third, a smooth manifold quad-only mesh is produced from the adopted Catmull–Clark scheme. A number of examples are given to demonstrate applications of our approach in various branch structures, such as tree branches, animal torsos, and vasculatures. Copyright © 2013 John Wiley & Sons, Ltd.
منابع مشابه
Adaptive tesselation of subdivision surfaces
For a variety of reasons subdivision surfaces have developed into a prominent member of the family of freeform shapes. Based on a standard polygonal mesh a modeller can build various kinds of shapes using an arbitrary topology and special geometrical features like creases. However, the interactive display of subdivision surfaces in current scenegraph systems based on static levels of detail is ...
متن کاملAdaptive Tesselation of Subdivision Surfaces in OpenSG
For a variety of reasons subdivision surfaces have developed into a prominent member of the family of freeform shapes. Based on a standard polygonal mesh modeller can build various kinds of shapes using an arbitrary topology and special geometrical features like creases. However, the interactive display of subdivision surfaces in current scenegraph systems based on static levels of detail is un...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملSubdivision Surface Tesselation on the Fly using a versatile Mesh Data Structure
Subdivision surfaces have become a standard technique for freeform shape modeling. They are intuitive to use and permit designers to flexibly add detail. But with larger control meshes, efficient adaptive rendering techniques are indispensable for interactive visualization and shape modeling. In this paper, we present a realization of tesselation-on-the-fly for Loop subdivision surfaces as part...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Visualization and Computer Animation
دوره 26 شماره
صفحات -
تاریخ انتشار 2015